Inferencing And Search For An Answer In TIBAQ

نویسندگان

  • Petr Jirku
  • Jan Hajic
چکیده

( i ) The procedure o f i n f e r e n c i n g i s a c t i v a t e d a f t e r the i n p u t s e n t e n c e has been r e c o g n i z e d as a q u e s t i o n . However, i t would be u s e l e s s to s e a r c h t h r o u g h t h e whole d a t a b a s e . Thus o n l y a sma l l p a r t o f t he d a t a base SQ, v i z . t he s e t o f r e p r e s e n t a t i o n s of s e n t e n c e s r e l e v a n t w i t h r e s p e c t t o a g i v e n q u e s t i o n Q, i s a c t i v a t e d , which c o n s i s t s of t hose s e n t e n c e s t h a t c o n t a i n a t l e a s t one t e rm s e m ~ u t i c a l l y e q u i v a l e n t w i t h an e lement a c t u a l l y o c c u r r i n g i n Q, i . e . i n t h e q u e s t i o n t o be answered . Th is s e t i s s e l e c t e d from the d a t a base f o r t h e i n f e r e n c e r u l e s t o o p e r a t e on i t . Let us deno te by Cn(SQ) t h e s e t o f a l l consequences o f SQ. Thus Cn(SQ) i s t h e t h e o r e t i c a l s e t o f s t a t e m e n t s r e l e v a n t f o r t he b u i l d u p of t h e answer . Such a s e t o f consequences would grow beyond any l i m i t s , so t h a t i t i s n e c e s s a r y to f o r m u l a t e a s t r a t e g y which c o n t r o l s t h e whole p r o c e s s . Two d i f f e r e n t s t r a t e g i e s w i l l be d i s c u s s e d .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iranian EFL Learners’ Lexical Inferencing Strategies at Both Text and Sentence levels

Lexical inferencing is one of the most important strategies in vocabulary learning and it plays an important role in dealing with unknown words in a text. In this regard, the aim of this study was to determine the lexical inferencing strategies used by Iranian EFL learners when they encounter unknown words at both text and sentence levels. To this end, forty lower intermediate students were div...

متن کامل

Inferencing On Linguistically Based Semantic Structures

The paper characterizes natural language inferencing in the TIBAQ method of question-answering, focussing on three aspects: ~i) specification of the structures on which the inference rules operate, (ii) classification of the rules that have been formulated and implemented up to now, according to the kind of modification of the input structure ti~e rules invoke, an~ (iii) discussion of some poin...

متن کامل

Optimizing question answering systems by Accelerated Particle Swarm Optimization (APSO)

One of the most important research areas in natural language processing is Question Answering Systems (QASs). Existing search engines, with Google at the top, have many remarkable capabilities. But there is a basic limitation (search engines do not have deduction capability), a capability which a QAS is expected to have. In this perspective, a search engine may be viewed as a semi-mechanized QA...

متن کامل

Offering a New Algorithm to Improve the Answer-Search Algorithm in Quadratic Assignment Problem

Layout design problem is one of the useful field of study used to increase the efficiency of sources in organizations. In order to achieve an appropriate layout design, it is necessary to define and solve the related nonlinear programming problems. Therefore, using computer in solving the related problems is important in the view of the researchers of this area of study. However, the designs pr...

متن کامل

L2 Learners’ Lexical Inferencing: Perceptual Learning Style Preferences, Strategy Use, Density of Text, and Parts of Speech as Possible Predictors

This study was intended first to categorize the L2 learners in terms of their learning style preferences and second to investigate if their learning preferences are related to lexical inferencing. Moreover, strategies used for lexical inferencing and text related issues of text density and parts of speech were studied to determine their moderating effects and the best predictors of lexical infe...

متن کامل

Using Greedy Randomize Adaptive Search Procedure for solve the Quadratic Assignment Problem

  Greedy randomize adaptive search procedure is one of the repetitive meta-heuristic to solve combinatorial problem. In this procedure, each repetition includes two, construction and local search phase. A high quality feasible primitive answer is made in construction phase and is improved in the second phase with local search. The best answer result of iterations, declare as output. In this stu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1982